Integer programming techniques for educational timetabling

Integer programming techniques for educational timetabling

Educational timetabling problems require the assignment of times and resources to events, while sets of required and desirable constraints must be considered. The XHSTT format was adopted in this work because it models the main features of educational timetabling and it is the most used format in recent studies in the eld. This work presents new cuts and reformulations for the existing integer ...

Local Search Techniques for Educational Timetabling Problems

Local Search is an emerging paradigm for combinatorial search, which has been recently shown to be very effective for a large number of combinatorial problems. Educational timetabling problems consist in scheduling a sequence of lectures or examinations between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of various types. Problems in th...

Integer programming for minimal perturbation problems in university course timetabling

In this paper we present a general integer programming-based approach for the minimal perturbation problem (MPP) in university course timetabling. This problem arises when an existing timetable contains hard constraint violations, or infeasibilities, which need to be resolved. The objective is to resolve these infeasibilities while minimising the disruption or perturbation to the remainder of t...

An Integer Programming Model for the School Timetabling Problem

This work presents a binary integer programming model applied to the process of fixing a sequence of meetings between teachers and students in a prefixed period of time, satisfying a set of constraints of various types, known as school timetabling problem. Pairs of teachers and classes associated to timeslots are modeled as binary integer variables weighted by parameters referring to teachers p...

Hybridizing Integer Programming and Metaheuristics for Solving High School Timetabling